منابع مشابه
Orthogonal Polynomials and Polynomial Approximations
3.1.1. Existence and uniqueness. Our immediate goal is to establish the existence of a sequence of orthogonal polynomials. Although we could, in principle, determine the coefficients a j of pn in the natural basis by using the orthogonality conditions (3.1.2), it is computationally advantageous to express pn in terms of lower-order orthogonal polynomials. Let us denote Pn := span { 1, x, x, · ·...
متن کاملIterated Bernstein polynomial approximations
Iterated Bernstein polynomial approximations of degree n for continuous function which also use the values of the function at i/n, i = 0, 1, . . . , n, are proposed. The rate of convergence of the classic Bernstein polynomial approximations is significantly improved by the iterated Bernstein polynomial approximations without increasing the degree of the polynomials. The same idea applies to the...
متن کاملOn Polynomial Approximations to AC
We make progress on some questions related to polynomial approximations of AC0. It is known, by works of Tarui (Theoret. Comput. Sci. 1993) and Beigel, Reingold, and Spielman (Proc. 6th CCC 1991), that any AC0 circuit of size s and depth d has an ε-error probabilistic polynomial over the reals of degree (log(s/ε))O(d). We improve this upper bound to (log s)O(d) · log(1/ε), which is much better ...
متن کاملPolynomial Approximations to Bessel Functions
A polynomial approximation to Bessel functions that arises from an electromagnetic scattering problem is examined. The approximation is extended to Bessel functions of any integer order, and the relationship to the Taylor series is derived. Numerical calculations show that the polynomial approximation and the Taylor series truncated to the same order have similar accuracies.
متن کاملPolynomial Approximations for Model Checking
The μ-Calculus of D.Kozen (1983) is a very powerful propositional program logic with fixpoints. It is widely used for specification and verification. Model checking is a very popular automatic approach for verification of specifications of finite state systems. The most efficient algorithms that have been developed so far for model checking the μ-Calculus in finite state systems have exponentia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Mathematica
سال: 2010
ISSN: 0039-3223,1730-6337
DOI: 10.4064/sm196-2-1